package j20251031;

public class Solution2 {
    boolean[][] vis;
    int m,n,sum;
    public int getMaximumGold(int[][] grid) {
        m=grid.length;
        n=grid[0].length;
        vis=new boolean[m][n];
        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){
                if(vis[i][j]==false&&grid[i][j]!=0){
                    vis[i][j]=true;
                    dfs(grid,i,j,grid[i][j]);
                    vis[i][j]=false;
                }
            }
        }
        return sum;
    }
    int[] dx={0,0,1,-1};
    int[] dy={1,-1,0,0};
    public void dfs(int[][] grid,int i,int j,int tmp){
        sum=Math.max(sum,tmp);
        for(int k=0;k<4;k++){
            int x=i+dx[k];
            int y=j+dy[k];
            if(x>=0&&x<m&&y>=0&&y<n&&vis[x][y]==false&&grid[x][y]!=0){
                vis[x][y]=true;
                dfs(grid,x,y,tmp+grid[x][y]);
                vis[x][y]=false;
            }
        }
    }
}
